Graphical t-designs via polynomial Kramer-Mesner matrices
نویسندگان
چکیده
منابع مشابه
Graphical t-designs via polynomial Kramer-Mesner matrices
Kramer-Mesner matrices have been used as a powerful tool to construct t-designs. In this paper we construct Kramer-Mesner matrices for xed values of k and t in which the entries are polynomials in n the number of vertices of the underlying graph. From this we obtain an elementary proof that with a few exceptions S 2] n is a maximal subgroup of S (n 2) or A (n 2). We also show that there are onl...
متن کاملNew quasi-symmetric designs by the Kramer-Mesner method
A t-(v, k, λ) design is quasi-symmetric if there are only two block intersection sizes. We adapt the Kramer-Mesner construction method for designs with prescribed automorphism groups to the quasi-symmetric case. Using the adapted method, we find many new quasi-symmetric 2-(28, 12, 11) and 2-(36, 16, 12) designs, establish the existence of quasi-symmetric 2-(56, 16, 18) designs, and find three n...
متن کاملOn Kramer-Mesner matrix partitioning conjecture
In 1977, Ganter and Teirlinck proved that any 2t× 2t matrix with 2t nonzero elements can be partitioned into four submatrices of order t of which at most two contain nonzero elements. In 1978, Kramer and Mesner conjectured that any mt× nt matrix with kt nonzero elements can be partitioned into mn submatrices of order t of which at most k contain nonzero elements. In 1995, Brualdi et al. showed ...
متن کاملEnumeration of t-Designs Through Intersection Matrices
In this paper, we exploit some intersection matrices to empower a backtracking approach based on Kramer–Mesner matrices. As an application, we consider the interesting family of simple t-ðtþ 8; tþ 2; 4Þ designs, 1 t 4, and provide a complete classification for t 1⁄4 1; 4, as well as a classification of all non-rigid designs for t 1⁄4 2; 3. We also enumerate all rigid designs for t 1⁄4 2. The co...
متن کاملInversion of polynomial matrices via state-space
In this paper, the problem of computing inverses of polynomial matrices has been revisited and algorithms of easy implementation are proposed to deal with either column or non-column reduced matrices. Other contributions of the paper are algorithms to perform column reduction and determinant of polynomial matrices. © 2002 Elsevier Science Inc. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1999
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)90045-6